Completeness of Resolution and Superposition Calculi
نویسنده
چکیده
We modify Bezem’s [Be] completeness proof for ground resolution in order to deal with ordered resolution, redundancy, and equational reasoning in form of superposition. The resulting proof is completely independent of the cardinality of the set of clauses.
منابع مشابه
Model Generation Style Completeness Proofs for Constraint Tableaux with Superposition
We present several calculi that integrate equality handling by superposition and ordered paramodulation into a free variable tableau calculus. We prove completeness of this calculus by an adaptation of themodel generation [1, 13] technique commonly used for completeness proofs of resolution calculi. The calculi and the completeness proof are compared to earlier results of Degtyarev and Voronkov...
متن کاملA Model Generation Style Completeness Proof for Constraint Tableaux with Superposition
We present a calculus that integrates equality handling by superposition into a free variable tableau calculus. We prove completeness of this calculus by an adaptation of the model generation [1, 15] technique commonly used for completeness proofs of resolution calculi. The calculi and the completeness proof are compared to earlier results of Degtyarev and Voronkov [7].
متن کاملA New Approach to Ordered Chaining
We present a new method for proving completeness of ordered chaining calculi for resolution-based rst-order reasoning with transitive relations. Previously, chaining rules were postulated and a posteriori ver-iied in semantic completeness proofs. We synthesize the rules from the transitivity axiom. Completeness of our calculi then follows from cor-rectness of their construction. Our method yiel...
متن کاملFormalizing Bachmair and Ganzinger’s Ordered Resolution Prover
We present a formalization of the first half of Bachmair and Ganzinger’s chapter on resolution theorem proving in Isabelle/HOL, culminating with a refutationally complete first-order prover based on ordered resolution with literal selection. We develop general infrastructure and methodology that can form the basis of completeness proofs for related calculi, including superposition. Our work cla...
متن کاملStrict Basic Superposition and Chaining
The most efficient techniques that have been developed to date for equality handling in first-order theorem proving are based on superposition calculi. Superposition is a refinement of paramodulation in that various ordering constraints are imposed on inferences. For practical purposes, a key aspect of superposition is its compatibility with powerful simplification techniques. In this paper we ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007